package dome1;

public class MyCycleQueue {
    public int[] elem;
    public int front;
    public int rear;

    public MyCycleQueue(int k) {
        elem = new int[k+1];
    }
    //入队列
    public boolean enQueue(int val) {
        if(isFull()) {
            return false;
        }
        elem[rear] = val;
        rear = (rear+1)% elem.length;
        return true;
    }
    private boolean isFull() {
        return (rear+1)%elem.length==front;
    }
    private boolean isEmpty() {
        return rear==front;
    }
    //出队列
    public boolean deQueue() {
        if(isEmpty()) {
            return false;
        }
        front = (front+1)%elem.length;
        return true;
    }
    //获取队头元素
    public int Front() {
        if(isEmpty()) {
            return -1;
        }
        return elem[front];
    }
    //获取队元素
    public int Rear() {
        if(isEmpty()) {
            return -1;
        }
        int index = (rear==0)?elem.length-1:rear-1;
        return elem[index];
    }
}
